On Generating Independent Random Strings
نویسنده
چکیده
It is shown that from two strings that are partially random and independent (in the sense of Kolmogorov complexity) it is possible to effectively construct polynomially many strings that are random and pairwise independent. If the two initial strings are random, then the above task can be performed in polynomial time. It is also possible to construct in polynomial time a random string, from two strings that have constant randomness rate.
منابع مشابه
Deviations from Uniformity in Random Strings
We show that almost all binary strings of length n contain all blocks of size (1-&)log, n a close to uniform number of times. From this, we derive tight bounds on the discrepancy of random infinite strings. Our results are obtained through explicit generating function expressions and contour integration estimates.
متن کاملStudy of Random Biased d-ary Tries Model
Tries are the most popular data structure on strings. We can construct d-ary tries by using strings over an alphabet leading to d-ary tries. Throughout the paper we assume that strings stored in trie are generated by an appropriate memory less source. In this paper, with a special combinatorial approach we extend their analysis for average profiles to d-ary tries. We use this combinatorial appr...
متن کاملThe Generation of Strings from a CFG using a Functional Language
It is common to describe the input to many programs and systems in terms of a context free grammar (CFG). In order to test programs that process strings generated from such grammars it would be extremely useful to have eeective methods of generating strings from the grammar itself. This paper explores a number of interesting issues that arise in generating such strings in the context of functio...
متن کاملGenerating Strings at Random from a Context Free Grammar
Given a context free grammar (CFG) G and an integer n >= 0 we present an algorithm for generating strings derivable from the grammar of length n such that all strings of length n are equally likely. The algorithm requires a pre-processing stage which calculates the number of strings of length k <= n derivable from each post x where A! is a production from the grammar. This step requiresO(n2) ti...
متن کاملAdiabatic fluctuations from cosmic strings in a contracting universe
We show that adiabatic, super-Hubble, and almost scale invariant density fluctuations are produced by cosmic strings in a contracting universe. An essential point is that isocurvature perturbations produced by topological defects such as cosmic strings on super-Hubble scales lead to a source term which seeds the growth of curvature fluctuations on these scales. Once the symmetry has been restor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009